Simulation-based priority rules for the stochastic resource-constrained net present value and risk problem
نویسندگان
چکیده
In this paper, the performance of activity-based and resource-based policies with newly designed priority rules for stochastic resource-constrained project scheduling problem is considered. The aim paper to maximize expected net present value (eNPV) minimize risk project's by semivariance measurement. 16 (mainly cash flow-based) heuristic are considered, among which 10 derived from deterministic NPV literature referred as direct rules, 6 developed based on simulation information. these in mentioned objective functions has been evaluated benchmark data set library. have ranked separately maximization eNPV minimization semivariance. computational results various test problems 120 activities show that top rank optimizing each function under both similar. Based obtained results, produce a schedule high eNPV, cause indicates trade-off between risk. selection best dependent risk-aversion level manager. A risk-averse manager recommended use rule discounted flow weight activity duration statistical at earliest finish time simulation-based policies. But risk-preferent it better cumulative latest
منابع مشابه
Maximising the Net Present Value for Resource-Constrained Project Scheduling
The Resource-constrained Project Scheduling Problem (Rcpsp), in which a schedule must obey the resource constraints and the precedence constraints between pairs of activities, is one of the most studied scheduling problems. An important variation of the problem (RcpspDc) is to find a schedule which maximises the net present value (discounted cash flow), when every activity has a given cash flow...
متن کاملMaximising the Net Present Value of Large Resource-Constrained Projects
The Resource-constrained Project Scheduling Problem (Rcpsp), in which a schedule must obey resource constraints and precedence constraints between pairs of activities, is one of the most studied scheduling problems. An important variation of this problem (RcpspDc) is to find a schedule which maximises the net present value (discounted cash flow). Large industrial applications can require thousa...
متن کاملA Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value
This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA).
In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have ...
متن کاملUncertain Resource-Constrained Project Scheduling Problem with Net Present Value Criterion
On the basis of uncertainty theory, plenty of researches have been done on uncertain resource-constrained project scheduling problems. Instead of minimizing the makespan, in this paper, we address the maximization of net present value of a project’s cash flows when activity durations are assumed to be uncertain. In addition to precedence constraint and resource constraint involved in resource-c...
متن کاملA Heuristic Algorithm for Project Scheduling Problem to Maximizing the Net Present Value
This paper deals with resource unconstrained project scheduling problems with the objective of maximizing the net present value (NPV) of project cash flows. Here we present a heuristic algorithm named as differential procedure (Dif_AOA). In order to evaluate the efficiency of this algorithm, networks with node numbers between 10-1000 and network complexity coefficients between 1.3-6.6 have be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Industrial Engineering
سال: 2021
ISSN: ['0360-8352', '1879-0550']
DOI: https://doi.org/10.1016/j.cie.2021.107607